Heuristic algorithms for Hadamard matrices with two circulant cores
نویسندگان
چکیده
We design heuristic algorithms to construct Hadamard matrices with two circulant cores. This hard combinatorial problem can be formulated in terms of objective functions of several binary variables, so that heuristic methodologies can be used. Our algorithms are based on local and tabu search and they use information on the geometry of the objective function landscapes. In addition, we use the supplementary difference sets formalism to detect when solutions of a special structure exist. Using these algorithms we have computed at least one Hadamard matrix with two circulant cores of the sixteen orders 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116. In particular, the Hadamard matrix with two circulant cores of order 116 is constructed here for the first time, indeed it was accidentally reported as known in an earlier paper. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Hadamard ideals and Hadamard matrices with two circulant cores
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamard ideal for this construction to systematize the application of Computational Algebra methods. Our approach yields an exhaustive search construction of Hadamard matrices with two circulant cores for this construction f...
متن کاملEncryption Schemes based on Hadamard Matrices with Circulant Cores
In this paper, we propose two encryption schemes based on Hadamard matrices with one and two circulant cores, which are classes of combinatorial designs. A cryptanalysis of the proposed schemes against some popular attacks, brute force, plaintext attacks and ciphertext attacks is explored and our study shows that these attacks does not compromise the security of the system. Furthermore, we make...
متن کاملHadamard ideals and Hadamard matrices with circulant core
Computational Algebra methods have been used successfully in various problems in many fields of Mathematics. Computational Algebra encompasses a set of powerful algorithms for studying ideals in polynomial rings and solving systems of nonlinear polynomial equations efficiently. The theory of Gröbner bases is a cornerstone of Computational Algebra, since it provides us with a constructive way of...
متن کاملFast circulant block Jacket transform based on the Pauli matrices
Owing to its orthogonality, simplicity of the inversion and fast algorithms, Jacket transform generalising from the Hadamard transform has played important roles in signal and image processing, mobile communication for coding design, cryptography, etc. In this paper, inspired by the emerging block Jacket transform, a new class of circulant block Jacket matrices (CBJMs) are mathematically define...
متن کاملWeaknesses in Hadamard Based Symmetric Key Encryption Schemes
In this paper security aspects of the existing symmetric key encryption schemes based on Hadamard matrices are examined. Hadamard matrices itself have symmetries like one circulant core or two circulant core. Here, we are exploiting the inherent symmetries of Hadamard matrices and are able to perform attacks on these encryption schemes. It is found that entire key can be obtained by observing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 407 شماره
صفحات -
تاریخ انتشار 2008